this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct in nite families of fullerenes generated by the oered process.

let $r$ be a commutative ring with identity‎. ‎we use‎ ‎$varphi (r)$ to denote the comaximal ideal graph‎. ‎the vertices‎ ‎of $varphi (r)$ are proper ideals of r which are not contained‎ ‎in the jacobson radical of $r$‎, ‎and two vertices $i$ and $j$ are‎ ‎adjacent if and only if $i‎ + ‎j = r$‎. ‎in this paper we show some‎ ‎properties of this graph together with planarity of line graph‎ ‎assoc...

Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...

let r be a fnite commutative ring and n(r) be the set of non unit elements of r. the non unit graph of r, denoted by gamma(r), is the graph obtained by setting all the elements of n(r) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin n(r). in this paper, the basic properties of gamma(r) are investigated and some characterization results regarding co...

in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.

a fullerene graph is a 3−connected planar graph whose faces are pentagons and hexagons.the clar number of a fullerene is the maximum size of sextet patterns, the sets of disjointhexagons which are all m-alternating for a kekulé structure m of f. an exact formula of clarnumber of some fullerene graphs and a class of carbon nanocones are obtained in this paper.

the crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.

We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.

‎let $g$ be a finite group which is not a cyclic $p$-group‎, ‎$p$ a prime number‎. ‎we define an undirected simple graph $delta(g)$ whose‎ ‎vertices are the proper subgroups of $g$, which are not contained in the‎ ‎frattini subgroup of $g$ and two vertices $h$ and $k$ are joined by an edge‎ ‎if and only if $g=langle h‎ , ‎krangle$‎. ‎in this paper we classify finite groups with planar graph‎. ‎...

‎Let $G$ be a finite group which is not a cyclic $p$-group‎, ‎$p$ a prime number‎. ‎We define an undirected simple graph $Delta(G)$ whose‎ ‎vertices are the proper subgroups of $G$, which are not contained in the‎ ‎Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge‎ ‎if and only if $G=langle H‎ , ‎Krangle$‎. ‎In this paper we classify finite groups with planar graph‎. ‎...